Description: 微软亚洲研究院论文:无线网络视频传输中功耗最低的资源分配策略-Microsoft Asia Research Institute paper : wireless network video transmission power of the minimum resource allocation strategies Platform: |
Size: 368251 |
Author:李刚 |
Hits:
Description: 一.算法介绍:
**数据结构:
1.可利用资源向量Available
2.最大需求矩阵Max
3.分配矩阵Allocation
4.需求矩阵Need
**功能介绍:
模拟实现Dijkstra的银行家算法以避免死锁的出现.分两部分组成:
第一部分:银行家算法(扫描)
1.如果Request<=Need,则转向2 否则,出错
2.如果Request<=Available,则转向3,否则等待
3.系统试探分配请求的资源给进程
4.系统执行安全性算法
第二部分:安全性算法
1.设置两个向量
(1).工作向量:Work=Available(表示系统可提供给进程继续运行所需要的各类资源数目)
(2).Finish:表示系统是否有足够资源分配给进程(True:有 False:没有).初始化为False
2.若Finish[i]=False&&Need<=Work,则执行3 否则执行4(I为资源类别)
3.进程P获得第i类资源,则顺利执行直至完成!并释放资源:
Work=Work+Allocation
Finish[i]=true
转2
4. 若所有进程的Finish[i]=true,则表示系统安全 否则,不安全!-one. Algorithm introduced : ** Data Structure : 1. The resources available vector Available 2. The biggest demand matrix Max 3. Allocation distribution matrix 4. Need ** demand matrix function presentations : Simulation of bankers Dijkstra algorithm to avoid the emergence of deadlock. Composed of two parts : Part I : bankers algorithm (scanning) 1. If Requestlt; = Need, has turned two Otherwise, the two errors. If Requestlt; = Available, has turned three, or wait for the three. System testing requested resource allocation process to four. Safety system for the implementation of the second part of algorithm : a security algorithm. Set up two vector (1). Vector work : Work = Available (expressed system available to the continued operation of the process required number of resources of all ki Platform: |
Size: 7881 |
Author:李琪 |
Hits:
Description: 一、实验目的:
熟悉银行家算法,理解系统产生死锁的原因及避免死锁的方法,加深记意。
二、实验要求:
用高级语言编写和调试一个描述银行家算法的程序。
三、实验内容:
1、 设计一个结构体,用于描述每个进程对资源的要求分配情况。包括:进程名——name[5],要求资源数目——command[m](m类资源),还需要资源数目——need[m],已分配资源数目——allo[m]。
2、 编写三个算法,分别用以完成:①申请资源;
②显示资源;③释放资源。(动态完成)-an experimental purposes : bankers familiar with the algorithm generated Deadlock understand the reasons and ways to avoid deadlock deepened memory. Two experimental requirements : high-level language writing and debugging an algorithm bankers described the procedure. 3, experiment : one, design a structure, which is used to describe each process of resource allocation of the request. Including : process name -- name [5], the number of requests for resources -- command [m] (m category resources), the number of required resources -- need [m], resources have been allocated number -- allo [m]. 2, the preparation of three algorithms, which were completed : for resources; indicated resources; freeing resources. (Dynamically) Platform: |
Size: 24353 |
Author:陈晨 |
Hits:
Description: 程序运行时,首先提示“请输入资源分配表文件的文件名:”;再提示“请输入进程等待表文件的文件名:”。
输入两个文件名后,程序将读入两个文件中的有关数据,并按照死锁检测算法进行检测。-running, first suggested "Please enter resource allocation table file name in the paper :"; another suggested "Please wait for the process to import files Table Name :." The two documents were imported, the program will read the two documents related data and in accordance with the deadlock detection algorithm for detection. Platform: |
Size: 2466 |
Author:王国强 |
Hits:
Description: this a base paper for describing the adaptive resource allocation. the objective is to minimize the transmit power.-this is a base paper for describing the adaptive resource allocation. the objective is to minimize the transmit power. Platform: |
Size: 792576 |
Author:Mustafa |
Hits:
Description: 在传统的子载波分配过程中,具有优先权的用户将优先选择最好的载波,这将导致载波利用效率下降。
许多改进算法通过牺牲一定的公平性来提升容量并降低复杂度,但是这可能会使用户间无法达到所要求的公平
性。针对这些问题,提出了一种基于公平度门限的载波和功率自适应分配算法。在载波分配过程中,通过公平度
门限来决定载波分配优先级,从而实现容量和公平度的粗略折中。载波分配后利用粒子群(PSO)算法进行功率分配来达到所要求的公平度门限。实验结果表明,该算法在满足所要求公平度门限的同时提升了系统容量。 -In traditional sub-carrier allocation process, user with the highest priority can choose best
sub-carrier, which will result in low utilization of sub-carriers. Current improved algorithms can im-
prove system capacity and reduce algorithm complexity by sacrificing certain fairness, but they may not
achieve fairness requirement among users. In order to solve this problem, a new adaptive resource allo-
cation algorithm based on fairness threshold was proposed, in which the priority of the sub-carrier allo-
cation was determined by fairness threshold to achieve a rough tradeoff between capacity and fairness.
Then power allocation base on particle swarm optimization (PSO) was introduced to realize the required
fairness. Experimental results show that the proposed adaptive resource allocation algorithm can satisfy
the fairness requirement threshold and improve system capacity. Platform: |
Size: 733184 |
Author:wangfei |
Hits:
Description: 基于资源池的与排序动态资源分配算法,是一篇可参考的文献-Based on the resource pool and sorting dynamic resource allocation algorithm Platform: |
Size: 2617344 |
Author:wentao |
Hits:
Description: Cognitive Radio Based Multi-User Resource
Allocation in Mobile Ad Hoc Networks Using
Multi-Carrier CDMA Modulation Platform: |
Size: 1361920 |
Author:Thushara |
Hits:
Description: 本文提出了一种针对多目标跟踪的MSRS 聚类与功率联合分配算法。-This paper proposes a joint cluster and power allocation algorithm for multiple targets tracking in
multistatic radar system. Platform: |
Size: 368640 |
Author:yjk |
Hits:
Description: 文章很好,可以查阅关于MIMO资源功率分配的文章,是IEEE的文章,仅供参考-Good article, can be found on the article MIMO power allocation of resources, is the IEEE article, for reference Platform: |
Size: 236544 |
Author:sa |
Hits:
Description: 资料中的代码主要对选择性中继中不同中继方式以及不同分集接收方式进行仿真分析比较并仿真实现了OFDM 系统的资源分配问题。-Data code mainly selective relay and the different ways in different relay diversity reception mode simulation analysis and simulation to achieve a relatively resource allocation problem OFDM system. Platform: |
Size: 56320 |
Author:张慧敏 |
Hits:
Description: There are three methods for handling deadlocks in resource allocation systems deadlock
prevention, deadlock avoidance and deadlock detection combined with recovery. Of these three
methods deadlock avoidance is preferable in many cases but seldom used on account of its high
cost. We present a simple modification of a known deadlock avoidance algorithm, the banker s
algorithm, which has a running time O(mn 2) in a system consisting of n processes and m
different types of resources. Our modified algorithm gives an amortized worst case running time of
O(mn) under certain likely conditions and in that way it can be considered a competitive method
for handling deadlocks. At worst, our algorithm is twice as fast as the banker s algorithm, Platform: |
Size: 951296 |
Author:yangs |
Hits:
Description: Spectrum sensing and resource allocation for
multicarrier cognitive radio systems under
interference and power constraints Platform: |
Size: 483328 |
Author:Mod |
Hits:
Description: D2D用户间的资源分配,对QoS的D2D通信资源分配算法研究有帮助-Resource allocation between D2D users, the D2D QoS communication resource allocation algorithm to help Platform: |
Size: 2048 |
Author:胡江川 |
Hits:
Description: 关于资源分配算法的OFDM仿真算法,在无线通信领域的。-An OFDM simulation algorithm for resource allocation algorithms in the field of wireless communications. Platform: |
Size: 10240 |
Author:邱念庭 |
Hits:
Description: A survey on one of the efficient research allocation scheme and it s performance when simulated in MATLAB. Platform: |
Size: 973824 |
Author:Rishi Aravind |
Hits:
Description: Multi-Objective Resource Allocation in a NOMA
Cognitive Radio Network With a Practical
Non-Linear Energy Harvesting Model Platform: |
Size: 7305216 |
Author:chaitu |
Hits: